Equational reasoning for conditioning as disintegration
نویسندگان
چکیده
Conditional distributions are widely used for practical inference, even when the condition has zero probability (such as setting a continuous variable to an observed value). This popularity contrasts with the scary pitfalls (such as Borel’s paradox) that beset rigorous treatments of conditioning. In general, conditional expectations may arise that do not correspond to any conditional distribution at all. This gap between theory and practice has made it difficult to automate conditioning calculations soundly. In particular, given a generative model, we want to produce its conditional expectations mechanically, so as to optimize them numerically, simplify them symbolically, and so on.
منابع مشابه
Term Equational Systems and Logics
We introduce an abstract general notion of system of equations between terms, called Term Equational System, and develop a sound logical deduction system, called Term Equational Logic, for equational reasoning. Further, we give an analysis of algebraic free constructions that together with an internal completeness result may be used to synthesise complete equational logics. Indeed, as an applic...
متن کاملAn Application of Automated Equational Reasoning to Many-valued Logic
In this paper we present the theorem prover SBR3 for equational logic and its application in the many-valued logic of Lukasiewicz. We give a new equational axiomatization of many-valued logic and we prove by SBR3 that it is equivalent to the classical equational presentation of such logic given by Wajsberg. We feel that our equational axiomatization of Wajsberg algebras is more suited for autom...
متن کاملFUZZY EQUATIONAL CLASSES ARE FUZZY VARIETIES
In the framework of fuzzy algebras with fuzzy equalities and acomplete lattice as a structure of membership values, we investigate fuzzyequational classes. They consist of special fuzzy algebras fullling the samefuzzy identities, dened with respect to fuzzy equalities. We introduce basicnotions and the corresponding operators of universal algebra: construction offuzzy subalgebras, homomorphisms...
متن کاملThe Technology Behind a Graphical User Interface for an Equational Reasoning Assistant
The Haskell Equational Reasoning Assistant (HERA) is an application written in Haskell that helps users construct and present equational reasoning style proofs[1]. In this paper we discuss the technology behind the user interface.
متن کاملEquational Reasoning for Prolog
Equational Reasoning is a feature of Functional Programming much envied by Logic Programmers. We argue that logic programmers should not shy away from adopting equational reasoning because of perceived pitfalls, but rather embrace it to indulge in its many benefits. We propose and illustrate two approaches: a cumbersome indirection via Haskell and a more insightful approach directly in Prolog.
متن کامل